Process Algebra with Probabilistic Choice

نویسنده

  • Suzana Andova
چکیده

Published results show that various models may be obtained by combining parallel composition with probability and with or without non-determinism. In this paper we treat this problem in the setting of process algebra in the form of ACP. First, probabilities are introduced by an operator for the internal probabilistic choice. In this way we obtain the Basic Process Algebra with probabilistic choice prBPA. Afterwards, prBPA is extended with parallel composition to ACPπ . We give the axiom system for ACPπ and a complete operational semantics that preserves the interleaving model for the dynamic concurrent processes. Considering the PAR protocol, a communication protocol that can be used in the case of unreliable channels, we investigate the applicability of ACPπ . Using in addition only the priority operator and the preabstraction operator we obtain a recursive specification of the behaviour of the protocol that can be viewed as a Markov chain.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Process algebra with interleaving probabilistic parallel composition

In this paper we present a probabilistic version of the axiom system A CP appropriate for the (algebraic) formal description of pIobabilisti.c processes. The proposed formalism is built in a modular way, first Basic Process Algebra (prBPA) is constructed which afterwards is extended by parallel composition (prACP). Probabilities are introduced by an operator for internal probabilistic choice. I...

متن کامل

A linear process-algebraic format with data for probabilistic automata

This paper presents a novel linear process-algebraic format for probabilistic automata. The key ingredient is a symbolic transformation of probabilistic process algebra terms that incorporate data into this linear format while preserving strong probabilistic bisimulation. This generalises similar techniques for traditional process algebras with data, and — more importantly — treats data and dat...

متن کامل

An Asynchronous Calculus for Generative-Reactive Probabilistic Systems

We present an asynchronous calculus for describing and analyzing probabilistic distributed systems that combines, in a simple way, probabilistic internal/external choices and multi-way synchronization, by employing the generative-reactive approach of EMPAgr. Such an approach is based on a master-slave discipline which leads to a clear notion of control over action synchronizations. Moreover the...

متن کامل

A Probabilistic Choice Model Based on Tsallis' Statistics

Decision under risk and uncertainty (probabilistic choice) has been attracting attention in econophysics and neuroeconomics. This paper proposes a probabilistic choice model based on a mathematical equivalence of delay and uncertainty in decision-making, and the deformed algebra developed in the Tsallis' non-extensive thermodynamics. Furthermore, it is shown that this model can be utilized to q...

متن کامل

An Asynchronous Calculus for Generative-Reactive Probalistic Systems

We present an asynchronous calculus for describing and analyzing probabilistic distributed systems that combines, in a simple way, probabilistic internal/external choices and multi-way synchronization, by employing the generative-reactive approach of EMPAgr. Such an approach is based on master-slave discipline which leads to a clear notion of control over action synchronizations. Moreover the m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999